Search results for "Structure Function"

Where do we go from here? Membrane protein research beyond the structure-function horizon.

2018

Structure-function relationship between FDF, FDT, SAP, and scanning laser ophthalmoscopy in glaucoma patients.

2012

Purpose Flicker defined form perimetry (FDF) and frequency doubling technology perimetry (FDT) are alleged to detect glaucoma at an earlier stage than standard automated perimetry (SAP). It is the purpose of this study to investigate the structure-function relationship between FDF, FDT, SAP, and confocal scanning laser ophthalmoscopy (cSLO) in patients with glaucoma. Methods Seventy-six patients with glaucoma were included in the study. Patients were tested with SAP, Matrix-FDT, FDF perimetry, and cSLO. Structure-function relationships between global and sectoral cSLO parameters and global and sectoral mean sensitivity (MS) of SAP, Matrix-FDT, and FDF were calculated using Spearman's rank c…

On the Structure of Amorphous Metals

2005

Application of kolmogorov complexity to inductive inference with limited memory

1995

A b s t r a c t . We consider inductive inference with limited memory[l]. We show that there exists a set U of total recursive functions such that U can be learned with linear long-term memory (and no short-term memory); U can be learned with logarithmic long-term memory (and some amount of short-term memory); if U is learned with sublinear long-term memory, then the short-term memory exceeds arbitrary recursive function. Thus an open problem posed by Freivalds, Kinber and Smith[l] is solved. To prove our result, we use Kolmogorov complexity.

Finite State Transducers with Intuition

2010

Finite automata that take advice have been studied from the point of view of what is the amount of advice needed to recognize nonregular languages. It turns out that there can be at least two different types of advice. In this paper we concentrate on cases when the given advice contains zero information about the input word and the language to be recognized. Nonetheless some nonregular languages can be recognized in this way. The help-word is merely a sufficiently long word with nearly maximum Kolmogorov complexity. Moreover, any sufficiently long word with nearly maximum Kolmogorov complexity can serve as a help-word. Finite automata with such help can recognize languages not recognizable …

Dark-matter detection by elastic and inelastic LSP scattering on 129Xe and 131Xe

2008

Abstract We calculate the nuclear matrix elements involved in the elastic and inelastic scattering of the lightest supersymmetric particle (LSP) on the 129Xe and 131Xe dark-matter detector nuclei. This is the first time when both channels are addressed within the same unified microscopic nuclear framework, namely we perform large-scale shell-model calculations with a realistic two-body interaction to produce the participant nuclear wave functions. These wave functions successfully reproduce the spectroscopic data on the relevant magnetic moments and M1 decays. The tested wave functions are used to produce annual average detection rates for both the elastic and inelastic channels. It is foun…

"Table 2" of "A Measurement of the photon structure function F2(gamma) at an average Q**2 of 12-GeV**2/c**4"

1995

Low x domain.

"Table 1" of "A Measurement of the photon structure function F2(gamma) at an average Q**2 of 12-GeV**2/c**4"

1995

No description provided.

"Table 3" of "Study of Dimuon Production in Photon-Photon Collisions and Measurement of QED Photon Structure Functions at LEP"

2001

Ratio of the structure functions FA and FB to F2.

"Table 14" of "Measurement of the proton and deuteron structure functions, F2(p) and F2(d), and of the ratio sigma(L)/sigma(T)."

1997

Corrected F2P measurements averaged over all energies. Data are the statistically weighted averages given at the centre of each bin.